O(N) Iterative and O(NlogN) Fast Direct Volume

نویسندگان

  • Dan Jiao
  • Saad Omar
چکیده

Linear complexity iterative and log-linear complexity direct solvers are developed for the volume integral equation (VIE) based general large-scale electrodynamic analysis. The dense VIE system matrix is first represented by a new clusterbased multilevel low-rank representation. In this representation, all the admissible blocks associated with a single cluster are grouped together and represented by a single low-rank block, whose rank is minimized based on prescribed accuracy. From such an initial representation, an efficient algorithm is developed to generate a minimal-rank H-matrix representation. This representation facilitates faster computation, and ensures the same minimal rank’s growth rate with electrical size as evaluated from singular value decomposition. Taking into account the rank’s growth with electrical size, we develop linear-complexity H-matrix-based storage and matrix-vector multiplication, and thereby an O(N) iterative VIE solver regardless of electrical size. Moreover, we develop an O(NlogN) matrix inversion, and hence a fast O(NlogN) direct VIE solver for large-scale electrodynamic analysis. Both theoretical analysis and numerical simulations of large-scale 1-, 2and 3-D structures on a singlecore CPU, resulting in millions of unknowns, have demonstrated the low complexity and superior performance of the proposed VIE electrodynamic solvers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multilevel Fast Multipole Algorithmfor Solving Combined Field

The fast multipole method (FMM) has been implemented to speed up the matrix-vector multiply when an iterative method is used to solve combined eld integral equation (CFIE). FMM reduces the complexity from O(N 2) to O(N 1:5). With a multilevel fast multipole algorithm (MLFMA), it is further reduced to O(NlogN). A 110,592 unknown problem can be solved within 24 hours on a SUN Sparc10.

متن کامل

Fast Krylov Methods for Clustering

At the heart of unsupervised clustering and semi-supervised clustering is the calculation of matrix eigenvalues(eigenvectors) or matrix inversion. In generally, its complexity is O(N). By using Krylov Subspace Methods and Fast Methods, we improve the performance to O(NlogN). We also make a thorough evaluation of errors introduced by the fast algorithm.

متن کامل

Fast solution of elliptic partial differential equations using linear combinations of plane waves.

Given an arbitrary elliptic partial differential equation (PDE), a procedure for obtaining its solution is proposed based on the method of Ritz: the solution is written as a linear combination of plane waves and the coefficients are obtained by variational minimization. The PDE to be solved is cast as a system of linear equations Ax=b, where the matrix A is not sparse, which prevents the straig...

متن کامل

Parallel Self-Tuning MLFMA Library

The Multilevel Fast Multipole Algorithm (MLFMA) has gained considerable attention for its ability to reduce the computational complexity of matrix-vector multiplies arising in the integral equation-based iterative solution of electromagnetic scattering problems. The MLFMA evaluates fields due to known source constellations comprising N discrete sources in a hierarchical framework that requires ...

متن کامل

Iterative Method for Recreating a Binary Tree from its Traversals

Many reconstruction algorithms for binary tree have been discussed in this paper. A particular focus of this paper is on “A new Non-Recursive Algorithm for Reconstructing a Binary Tree from its Traversals”. The computation time required for executing the reconstruction algorithm are O(N) and space complexity is O(NlogN) where N is the number of nodes in the binary tree. This algorithm works wel...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017